Intruder Theories (Ongoing Work)
نویسنده
چکیده
– A finite number of processes called roles, each of which is parametrized by agent identities and consists of a sequence of name generation, the nonces and a finite sequence of rules u ⇒ v, which should be read as “upon receiving a message matching u, send the corresponding message v.” – A description of intruder capabilities, sometimes given as a proof system, which we call hereafter the offline intruder theory.
منابع مشابه
A Proof Theoretic Analysis of Intruder Theories
We consider the decidability problem of intruder deduction in security protocol analysis, that is, deciding whether a given message M can be deduced from a set of messages Σ, under the class of convergent equational theories, modulo associativity and commutativity (AC) of certain binary operators. The traditional formulations of intruder deduction are usually given in natural-deduction-like sys...
متن کاملHierarchical Combination of Intruder Theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weaknesses, by a more accurate modelling of operators employed by protocols. Several works have shown how to handle a single algebraic operator (associated with a fixed intruder theory) or how to combine several operators s...
متن کاملCombining Intruder Theories
Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples of such sets of operators comprise XOR, multiplication/exponentiation, abstract encryption/decryption. In this report we give an algorithm for combining decision procedures for arbitrary intruder theories with disjoint sets of ope...
متن کاملAn intruder model with message inspection for model checking security protocols
Model checking security protocols is based on an intruder model that represents the eavesdropping or interception of the exchanged messages, while at the same time performs attack actions against the ongoing protocol session(s). Any attempt to enumerate all messages that can be deduced by the intruder and the possible actions in all protocol steps results in an enormous branching of the model’s...
متن کاملRelation between Unification Problem and Intruder Deduction Problem
Intruder deduction problem constitutes the first step in cryptographic protocols verification for a passive intruder. In the case of an active intruder, we know that undecidability of the unification problem implies undecidability of the secrecy problem. In this paper, we analyze the link between the unification problem and the intruder deduction problem. Through examples using equational theor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004